//Container With Most Water
/*
#include <vector>
#include <time.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
using namespace std;
int maxArea(vector<int>& height) {
	int l,r,re=0,k;
	l=0;r=height.size()-1;
	while(l<r){
		re=max(re,min(height[l],height[r])*(r-l));
		if(height[l]<height[r]){
			k=l;
			while(k<r&&height[k]<=height[l])
				k++;
			l=k;
		}else{
			k=r;
			while(l<k&&height[k]<=height[r])
				k--;
			r=k;
		}
	}
	return re;
}
int main(){
	string s,p;
	int a[]={1,2,3,4};
	vector<int>v1(a,a+sizeof(a)/sizeof(int));
	
	cout<<maxArea(v1);
	system("pause");
	return 0;
}
*/